Asymptotics of maximum likelihood estimators based on Markov chain Monte Carlo methods

نویسندگان

چکیده

In complex statistical models, in which exact computation of the likelihood is intractable, Monte Carlo methods can be applied to approximate maximum estimates. this paper we consider approximation obtained via Markov chain Carlo. We prove consistency and asymptotic normality resulting estimator, when both sample sizes (the initial one) tend infinity. Our results models with intractable normalizing constants missing data models. also investigate properties estimators numerical experiments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Chain Monte Carlo Maximum Likelihood

Markov chain Monte Carlo (e. g., the Metropolis algorithm and Gibbs sampler) is a general tool for simulation of complex stochastic processes useful in many types of statistical inference. The basics of Markov chain Monte Carlo are reviewed, including choice of algorithms and variance estimation, and some new methods are introduced. The use of Markov chain Monte Carlo for maximum likelihood est...

متن کامل

Study of Preconditioners based on Markov Chain Monte Carlo Methods

Nowadays, analysis and design of novel scalable methods and algorithms for fundamental linear algebra problems such as solving Systems of Linear Algebraic Equations with focus on large scale systems is a subject of study. This research focuses on the study of novel mathematical methods and scalable algorithms for computationally intensive problems such as Monte Carlo and Hybrid Methods and Algo...

متن کامل

Estimation of Markov random field prior parameters using Markov chain Monte Carlo maximum likelihood

Recent developments in statistics now allow maximum likelihood estimators for the parameters of Markov random fields (MRFs) to be constructed. We detail the theory required, and present an algorithm that is easily implemented and practical in terms of computation time. We demonstrate this algorithm on three MRF models--the standard Potts model, an inhomogeneous variation of the Potts model, and...

متن کامل

Sequentially Interacting Markov Chain Monte Carlo Methods

We introduce a novel methodology for sampling from a sequence of probability distributions of increasing dimension and estimating their normalizing constants. These problems are usually addressed using Sequential Monte Carlo (SMC) methods. The alternative Sequentially Interacting Markov Chain Monte Carlo (SIMCMC) scheme proposed here works by generating interacting non-Markovian sequences which...

متن کامل

Markov chain Monte Carlo methods in biostatistics.

Appropriate models in biostatistics are often quite complicated. Such models are typically most easily fit using Bayesian methods, which can often be implemented using simulation techniques. Markov chain Monte Carlo (MCMC) methods are an important set of tools for such simulations. We give an overview and references of this rapidly emerging technology along with a relatively simple example. MCM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'I.H.P

سال: 2021

ISSN: ['0246-0203', '1778-7017']

DOI: https://doi.org/10.1214/20-aihp1097